翻訳と辞書
Words near each other
・ Nielsen Fjord
・ Nielsen Glacier
・ Nielsen Hayden
・ Nielsen Media Research
・ Nielsen N.V.
・ Nielsen Norman Group
・ Nielsen Online
・ Nielsen Park
・ Nielsen Prize
・ Nielsen Pro Tennis Championships
・ Nielsen ratings
・ Nielsen realization problem
・ Nielsen RingScan
・ Nielsen SoundScan
・ Nielsen theory
Nielsen transformation
・ Nielsen VideoScan
・ Nielsen/Pearson
・ Nielsenia
・ Nielsenichthys pullus
・ Nielsenoceras
・ Nielsen–Ninomiya theorem
・ Nielsen–Olesen vortex
・ Nielsen–Olsen string
・ Nielsen–Schreier theorem
・ Nielsen–Thurston classification
・ Nielsine
・ Nielsine Nielsen
・ Nielsine Paget
・ Nielson


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Nielsen transformation : ウィキペディア英語版
Nielsen transformation
In mathematics, especially in the area of abstract algebra known as combinatorial group theory, Nielsen transformations, named after Jakob Nielsen, are certain automorphisms of a free group which are a non-commutative analogue of row reduction and one of the main tools used in studying free groups, . They were introduced in to prove that every subgroup of a free group is free (the Nielsen–Schreier theorem), but are now used in a variety of mathematics, including computational group theory, k-theory, and knot theory. The textbook devotes all of chapter 3 to Nielsen transformations.
==Definitions==

One of the simplest definitions of a Nielsen transformation is an automorphism of a free group, but this was not their original definition. The following gives a more constructive definition.
A Nielsen transformation on a finitely generated free group with ordered basis (''x''1, …, ''x''''n'' ) can be factored into elementary Nielsen transformations of the following sorts:
* Switch ''x''1 and ''x''2
* Cyclically permute ''x''1, ''x''2, …, ''x''''n'', to ''x''2, …, ''x''''n'', ''x''1.
* Replace ''x''1 with ''x''1−1
* Replace ''x''1 with ''x''1·''x''2
These transformations are the analogues of the elementary row operations. Transformations of the first two kinds are analogous to row swaps, and cyclic row permutations. Transformations of the third kind correspond to scaling a row by an invertible scalar. Transformations of the fourth kind correspond to row additions.
Transformations of the first two types suffice to permute the generators in any order, so the third type may be applied to any of the generators, and the fourth type to any pair of generators.
When dealing with groups that are not free, one instead applies these transformations to finite ordered subsets of a group. In this situation,
compositions of the elementary transformations are called regular. If one allows removing elements of the subset that are the identity element, then the transformation is called singular.
The image under a Nielsen transformation (elementary or not, regular or not) of a generating set of a group ''G'' is also a generating set of ''G''. Two generating sets are called Nielsen equivalent if there is a Nielsen transformation taking one to the other. If the generating sets have the same size, then it suffices to consider compositions of regular, elementary Nielsen transformations.

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Nielsen transformation」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.